Supervised learning with indefinite topological Kernels

نویسندگان

چکیده

Topological Data Analysis (TDA) is a new branch of statistics devoted to the study ‘shape’ data. As TDA's tools are typically defined in complex spaces, kernel methods often used perform inferential task by implicitly mapping topological summaries, most noticeably Persistence Diagram (PD), vector spaces. For positive definite kernels on PDs, however, embeddings do not fully retain metric structure original space. We introduce exponential kernel, built geodesic space and we show with simulated real applications how it can be successfully regression classification tasks, despite being definite.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning SVM Classifiers with Indefinite Kernels

Recently, training support vector machines with indefinite kernels has attracted great attention in the machine learning community. In this paper, we tackle this problem by formulating a joint optimization model over SVM classifications and kernel principal component analysis. We first reformulate the kernel principal component analysis as a general kernel transformation framework, and then inc...

متن کامل

Ensemble Learning with Supervised Kernels

Kernel-based methods have outstanding performance on many machine learning and pattern recognition tasks. However, they are sensitive to kernel selection, they may have low tolerance to noise, and they can not deal with mixed-type or missing data. We propose to derive a novel kernel from an ensemble of decision trees. This leads to kernel methods that naturally handle noisy and heterogeneous da...

متن کامل

Support vector machines with indefinite kernels

Training support vector machines (SVM) with indefinite kernels has recently attracted attention in the machine learning community. This is partly due to the fact that many similarity functions that arise in practice are not symmetric positive semidefinite, i.e. the Mercer condition is not satisfied, or the Mercer condition is difficult to verify. Previous work on training SVM with indefinite ke...

متن کامل

Support Vector Machine Classification with Indefinite Kernels

We propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our algorithm simultaneously computes support vectors and a proxy kernel matrix used in forming the loss. This can be interpreted as a penalized kernel learning problem where indefinite kernel matrices are treated as a noisy observation...

متن کامل

Supervised learning of local projection kernels

We formulate a supervised, localized dimensionality reduction method using a gating model that divides up the input space into regions and selects the dimensionality reduction projection separately in each region. The gating model, the locally linear projections, and the kernel-based supervised learning algorithm which uses them in its kernels are coupled and their training is performed with an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics

سال: 2021

ISSN: ['1029-4910', '0233-1888', '1026-7786']

DOI: https://doi.org/10.1080/02331888.2021.1976777